Las Vegas , July 2000 Improving EAs for Sequencing Problems

نویسنده

  • Rolf Drechsler
چکیده

Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. However, they often suuer from the high CPU time which is necessary for the computation. In this paper we propose three techniques to speed up EAs without loss of quality. We give a case study for the problem of optimizing the variable ordering of Binary Decision Diagrams (BDDs). Experimental results are given to demonstrate the eeciency of the approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dimensionality Reduction Techniques for Proximity Problems Piotr Indyk Stanford University

In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 +)-nearest neighbor with polynomial space and query time polynomial in dimension d and logn, where n is the database size. We also give a deterministic 3-approximation algorithm with similar bounds; this is the rst deterministic...

متن کامل

Removal of nutrients and metals by constructed and naturally created wetlands in Las Vegas Valley, Nevada, July 2010

Increased water use associated with rapid growth in the Las Vegas Valley has inadvertently led to the creation of unique wetland systems in Southern Nevada with an abundance of biological diversity. Constructed and naturally created wetlands in the Las Vegas Valley watershed were studied to characterize and understand their potential role for improving ecosystem services (i.e., water purificati...

متن کامل

Space-Efficient Las Vegas Algorithms for K-SUM

Using hashing techniques, this paper develops a family of space-efficient Las Vegas randomized algorithms for k-SUM problems. This family includes an algorithm that can solve 3-SUM in O(n) time and O( √ n) space. It also establishes a new time-space upper bound for SUBSETSUM, which can be solved by a Las Vegas algorithm in O(2 √ 8 9 ) time and O(2) space, for any β ∈ [0, 9 32 ].

متن کامل

Identification of an in Vivo Inhibitor of Bacillus Anthracis Sterne Spore Germination

*Correspondence should be addressed to Ernesto Abel-Santos or Jürgen Brojatsch. EAS: Department of Chemistry, University of Nevada Las Vegas, 4505 Maryland Pkwy-Box 454003, Las Vegas, NV 89154, Tel. 702 895-2608, Fax. 702 895-4072, E-mail: [email protected]. JB: Department of Microbiology and Immunology, Albert Einstein College of Medicine, Golding 404, 1300 Morris Park Avenue, Bronx,...

متن کامل

Complex scattering lengths for ultracold He collisions with rotationally excited linear and nonlinear molecules

Benhui Yang,1,* R. C. Forrey,2 P. C. Stancil,1 and N. Balakrishnan3 1Department of Physics and Astronomy and the Center for Simulational Physics, The University of Georgia, Athens, Georgia 30602, USA 2Department of Physics, Penn State University, Berks Campus, Reading, Pennsylvania 19610, USA 3Department of Chemistry, University of Nevada Las Vegas, Las Vegas, Nevada 89154, USA (Received 29 Jul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000